Efficient routeing in Poisson small-world networks
نویسندگان
چکیده
منابع مشابه
Efficient Routeing in Poisson Small-world Networks
In a recent paper, Kleinberg (2000) considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power, r−α , of the distance, r , between them. Kleinberg showed that greedy routeing is efficient if α = d and that there is no efficient decentralised routeing algorithm if α = d. T...
متن کاملEfficient routing in Poisson small-world networks
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power, r−α, of the distance r between them. Kleinberg showed that greedy routing is efficient if α = d and that there is no efficient decentralised routing algorithm if α 6= d. The results ...
متن کاملSmall-world Structure in Children’s Featured Semantic Networks
Background: Knowing the development pattern of children’s language is applicable in developmental psychology. Network models of language are helpful for the identification of these patterns. Objectives: We examined the small-world properties of featured semantic networks of developing children. Materials & Methods: In this longitudinal study, the featured semantic networks of children aged 1...
متن کاملEfficient behavior of small-world networks.
We introduce the concept of efficiency of a network as a measure of how efficiently it exchanges information. By using this simple measure, small-world networks are seen as systems that are both globally and locally efficient. This gives a clear physical meaning to the concept of "small world," and also a precise quantitative analysis of both weighted and unweighted networks. We study neural ne...
متن کاملEfficient Network Routeing
We believe that the control currently provided by routeing in the Internet is becoming demonstrably insufficient for the demands of network operators and users. Current routeing protocols provide little or no support for automation of network management, leaving such things as construction and implementation of SLAs and the pricing of resources entirely to the network manager. The research prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2006
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200002023